Underdetermined blind separation of sparse sources with instantaneous and convolutive mixtures

نویسندگان

  • David Luengo
  • Ignacio Santamaría
  • Luis Vielva
  • Carlos Pantaleón
چکیده

We consider the underdetermined blind source separation problem with linear instantaneous and convolutive mixtures when the input signals are sparse, or have been rendered sparse. In the underdetermined case the problem requires solving three subproblems: detecting the number of sources, estimating the mixing matrix, and finding an adequate inversion strategy to obtain the sources. This paper solves the first two problems. We assume that the number of sources is unknown, and estimate it by means of an information theoretic criterion (MDL). Then the mixing matrix is expressed in spheric coordinates and we estimate sequentially the angles and amplitudes of each column, and their order. The performance of the method is illustrated through simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separating Underdetermined Convolutive Speech Mixtures

A limitation in many source separation tasks is that the number of source signals has to be known in advance. Further, in order to achieve good performance, the number of sources cannot exceed the number of sensors. In many real-world applications these limitations are too restrictive. We propose a method for underdetermined blind source separation of convolutive mixtures. The proposed framewor...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Blind Separation of Time/Position Varying Mixtures

We address the fascinating open engineering problem of blindly separating time/position varying mixtures, and attempt to separate the sources from such mixtures without having prior information about the sources or the mixing system. Unlike studies concerning instantaneous or convolutive mixtures, we assume that the mixing system (medium) is changing in time/position. Attempts to solve this pro...

متن کامل

Blind partial separation of underdetermined convolutive mixtures of complex sources based on differential normalized kurtosis

This paper concerns the blind separation of P complex convolutive mixtures of N statistically independent complex sources, with underdetermined or noisy mixtures i.e. P < N . Our approach exploits the assumed distinct statistical properties of the sources: P sources are non-stationary, while the others are stationary. Our method achieves the ”partial separation” of the P non-stationary sources....

متن کامل

Adaptive subspace algorithm for blind separation of independent sources in convolutive mixture

We propose an algorithm for blind separation of sources in convolutive mixtures based on a subspace approach. The advantage of this algorithm is that it reduces a convolutive mixture to an instantaneous mixture by using only second-order statistics (but more sensors than sources). Furthermore, the sources can be separated by using any algorithm for an instantaneous mixture (based generally on f...

متن کامل

MAP-Based Underdetermined Blind Source Separation of Convolutive Mixtures by Hierarchical Clustering and ℓ1-Norm Minimization

We address the problem of underdetermined BSS. While most previous approaches are designed for instantaneous mixtures, we propose a time-frequency-domain algorithm for convolutive mixtures. We adopt a two-step method based on a general maximum a posteriori (MAP) approach. In the first step, we estimate the mixing matrix based on hierarchical clustering, assuming that the source signals are suff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003